Computing Singular Elements Modulo Squares
نویسندگان
چکیده
The group of singular elements was first introduced by Helmut Hasse and later it has been studied numerous authors including such well known mathematicians as: Cassels, Furtwängler, Hecke, Knebusch, Takagi course himself; to name just a few. aim the present paper is algorithms that explicitly construct groups S-singular (modulo squares) in global function field.
منابع مشابه
Linear Codes Through Latin Squares Modulo n
It is known that t mutually orthogonal latin squares of order n generate a b t 2c-error correcting code with n codewords. In this paper we consider latin squares of order n made up of elements taken from Zn. In this situation we consider when this code is linear. We present neccessary and sufficient conditions on the latin squares and obtain a method of constructing a maximal family of mutually...
متن کاملEven Order Regular Magic Squares Are Singular
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملRegularization of singular least squares problems
In this note we analyze the in uence of the regularization procedure applied to singular LS square problems It appears that due to nite numerical accuracy within the computer calculations the regularization parameter has to belong to a particular range of values in order to have the regularized solution close to that associated to the singular LS problem Surprisingly enough this range essential...
متن کاملSingular Values and Least Squares Matching
In this paper we investigate least squares matching problems, extending the methods of our earlier paper 1] in such a way as to make them applicable to problems involving the sets of points that are so complex that approximate answers are of interest. These problems are formulated in terms of continuous descent equations, and lower bounds on the quality of the best match are obtained in terms o...
متن کاملComputing GCDs of polynomials modulo triangular sets
We present a modular algorithm for computing GCDs of univariate polynomials with coefficients modulo a zero-dimensional triangular set. Our algorithm generalizes previous work for computing GCDs over algebraic number fields. The main difficulty is when a zero divisor is encountered modulo a prime number. We give two ways of handling this: Hensel lifting, and fault tolerant rational reconstructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2021
ISSN: ['1875-8681', '0169-2968']
DOI: https://doi.org/10.3233/fi-2021-2022